A Watermarking Method for 3D Printing Based on Menger Curvature and K-Mean Clustering

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

K-mean Based Clustering and Context Quantization

In this thesis, we study the problems of K-means clustering and context quantization. The main task of K-means clustering is to partition the training patterns into k distinct groups or clusters that minimize the mean-square-error (MSE) objective function. But the main difficulty of conventional K-means clustering is that its classification performance is highly susceptible to the initialized s...

متن کامل

Menger curvature and rectifiability

E3 c(x, y, z)dH(x)dH(y)dH(z) where H1 is the 1-dimensional Hausdorff measure in Rn, c(x, y, z) is the inverse of the radius of the circumcircle of the triangle (x, y, z), that is, following the terminology of [6], the Menger curvature of the triple (x, y, z). A Borel set E ⊂ Rn is said to be “purely unrectifiable” if for any Lipschitz function γ : R → Rn, H1(E ∩ γ(R)) = 0 whereas it is said to ...

متن کامل

Multipurpose Image Watermarking Method Based on Mean-removed Vector Quantization

Digital watermarking technique has been presented and widely researched to solve some important issues in the digital world, such as copyright protection, copy protection, and content authentication. Conventional watermarking algorithms are mostly based on discrete cosine transform (DCT), discrete Fourier transform (DFT), and discrete wavelet transform (DWT). Most of these algorithms are design...

متن کامل

A Genetic Algorithm for K-Mean Clustering

A Genetic Algorithm for K-Mean Clustering Varsha Singh Asst. Prof. JSSATE, Noida, Uttar Pradesh, India Prof A K Misra Professor, Deptt of CSE, MNNIT Allahabad, Uttar Pradesh, India _________________________________________________________________________________________ Abstract: Clustering techniques have obtained adequate results when are applied to data mining problems. Clustering is the pro...

متن کامل

Menger Curvature and Rectifiability 833

where H1 is the 1-dimensional Hausdorff measure in Rn, c(x, y, z) is the inverse of the radius of the circumcircle of the triangle (x, y, z), that is, following the terminology of [6], the Menger curvature of the triple (x, y, z). A Borel set E ⊂ Rn is said to be “purely unrectifiable” if for any Lipschitz function γ : R → Rn, H1(E ∩ γ(R)) = 0 whereas it is said to be rectifiable if there exist...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Symmetry

سال: 2018

ISSN: 2073-8994

DOI: 10.3390/sym10040097